Minimum Description Length and Psychological Clustering Models

نویسندگان

  • Michael D. Lee
  • Daniel J. Navarro
چکیده

Clustering is one of the most basic and useful methods of data analysis. This chapter describes a number of powerful clustering models, developed in psychology, for representing objects using data that measure the similarities between pairs of objects. These models place few restrictions on how objects are assigned to clusters, and allow for very general measures of the similarities between objects and clusters. Geometric Complexity Criteria (GCC) are derived for these models, and are used to fit the models to similarity data in a way that balances goodness-of-fit with complexity. Complexity analyses, based on the GCC, are presented for the two most widely used psychological clustering models, known as " additive clustering " and " additive trees " .

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bayesian context clustering using cross valid prior distribution for HMM-based speech recognition

Decision tree based context clustering [Young; '94] ・ Construct a parameter tying structure ・ Can estimate robust parameter ・ Can generate unseen context dependent models ・ Minimum description length (MDL) criterion [Shinoda; '97] Bayesian approach ・ Variational Bayesian (VB) method [Attias; '99] ⇒ Applied to speech recognition [Watanabe; '04] ・ Can use prior information ⇒ Affect context cluste...

متن کامل

The Cruncher: Automatic Concept Formation Using Minimum Description Length

We present The Cruncher, a simple representation framework and algorithm based on minimum description length for automatically forming an ontology of concepts from attribute-value data sets. Although unsupervised, when The Cruncher is applied to an animal data set, it produces a nearly zoologically accurate categorization. We demonstrate The Cruncher’s utility for finding useful macro-actions i...

متن کامل

Inferring Informed Clustering Problems with Minimum Description Length Principle

...............................................................................................................................iii Acknowledgements.............................................................................................................. iv Table of

متن کامل

Towards a Simple Clustering Criterion Based on Minimum Length Encoding

We propose a simple and intuitive clustering evaluation criterion based on the minimum description length principle which yields a particularly simple way of describing and encoding a set of examples. The basic idea is to view a clustering as a restriction of the attribute domains, given an example's cluster membership. As a special operational case we develop the so-called rectangular uniform ...

متن کامل

Visual Abstraction of Wildlife Footage Using Gaussian Mixture Models and the Minimum Description Length Criterion

In this paper, we present a novel approach for clipbased key frame extraction. Our framework allows both clips with subtle changes as well as clips containing rapid shot changes, fades and dissolves to be well approximated. We show that creating key frame video abstractions can be achieved by transforming each frame of a video sequence into an eigenspace and then clustering this space using Gau...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005